- least cost search
- Математика: поиск по критерию наименьшей стоимости
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Uniform-cost search — In computer science, uniform cost search (UCS) is a tree search algorithm used for traversing or searching a weighted tree, tree structure, or graph. Intuitively, the search begins at the root node. The search continues by visiting the next node… … Wikipedia
Search data structure — In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database. The simplest, most general, and least efficient search… … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
Harmony search — (HS) is a metaheuristic algorithm (also known as soft computing algorithm or evolutionary algorithm) mimicking the improvisation process of musicians. In the process, each musician plays a note for finding a best harmony all together. Likewise,… … Wikipedia
B* search algorithm — In computer science, B* (pronounced B star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is… … Wikipedia
Index (search engine) — Search engine indexing collects, parses, and stores data to facilitate fast and accurate information retrieval. Index design incorporates interdisciplinary concepts from linguistics, cognitive psychology, mathematics, informatics, physics, and… … Wikipedia
No free lunch in search and optimization — This article is about mathematical analysis of computing. For associated folklore, see No free lunch theorem. The problem is to rapidly find a solution among candidates a, b, and c that is as good as any other, where goodness is either 0 or 1.… … Wikipedia
Local search (constraint satisfaction) — In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. It is based on iteratively improving an assignment of the variables until all constraints are satisfied. In particular, local search algorithms… … Wikipedia
Google Book Search — Infobox Software | name = Google Book Search caption = Google Book Search screenshot developer = Google latest release version = latest release date = latest preview version = latest preview date = operating system = Any (web based application)… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
In Search of Lost Time — Swann s Way redirects here. For other similar titles, see Swans Way (disambiguation). In Search of Lost Time (Remembrance of Things Past) … Wikipedia